Computational hardness assumptions - PDFSEARCH.IO - Document Search Engine

Computational hardness assumptions
Results: 76

#	Item
61	ANTS IX, Nancy, France Fixed points for discrete logarithms Add to Reading List Source URL: www.math.dartmouth.edu Language: English - Date: 2010-07-16 15:47:41 Computational hardness assumptions Finite fields Logarithms Modular arithmetic Group theory Discrete logarithm Cyclic group Diffie–Hellman problem Prime number Abstract algebra Mathematics Algebra
62	Short Signatures from the Weil Pairing∗ Dan Boneh† [removed] Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2007-09-08 17:10:53 Finite fields BLS Computational hardness assumptions Digital signature Full Domain Hash Rabin signature algorithm Diffie–Hellman key exchange Diffie–Hellman problem Elliptic Curve DSA Cryptography Public-key cryptography Cryptographic protocols
63	A Practical and Provably Secure Coalition-Resistant Group Signature Scheme Giuseppe Ateniese1 , Jan Camenisch2 , Marc Joye3 , and Gene Tsudik4 Add to Reading List Source URL: www.zurich.ibm.com Language: English - Date: 2000-10-24 11:52:18 Finite fields Cryptographic protocols Group signature Diffie–Hellman key exchange Digital signature Computational Diffie–Hellman assumption ElGamal encryption Diffie–Hellman problem Schnorr signature Cryptography Computational hardness assumptions Public-key cryptography
64	Number field cryptography Johannes Buchmann Add to Reading List Source URL: www.cdc.informatik.tu-darmstadt.de Language: English - Date: 2004-02-18 05:25:39 Finite fields Computational hardness assumptions Algebraic number theory Cryptographic protocols Field theory Diffie–Hellman problem Quadratic field Discrete logarithm XTR Abstract algebra Mathematics Algebra
65	Evaluation of Security Level of Cryptography: ACE Signature Scheme Alfred Menezes, Minghua Qu, Doug Stinson, Yongge Wang Add to Reading List Source URL: www.ipa.go.jp Language: English - Date: 2013-06-03 22:32:58 Electronic commerce Key management RSA Integer factorization Digital signature Key size Strong RSA assumption Elliptic curve cryptography Random oracle Cryptography Public-key cryptography Computational hardness assumptions
66	In Advances in Cryptology—CRYPTO ’99, Vol[removed]of Lecture Notes in Computer Science, Springer-Verlag, 1999. pp[removed]A Simple Publicly Verifiable Secret Sharing Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2001-04-03 10:12:09 Public-key cryptography Publicly Verifiable Secret Sharing Finite fields Verifiable secret sharing Secret sharing ElGamal encryption Diffie–Hellman key exchange Diffie–Hellman problem Decisional Diffie–Hellman assumption Cryptography Cryptographic protocols Computational hardness assumptions
67	Workshop on Selected Areas in Cryptography[removed] – 16 august 2002, St. John’s, Newfoundland, Canada) H. Heys and K. Nyberg Eds. Springer-Verlag, LNCS 2595, pages 325–338 Add to Reading List Source URL: www.di.ens.fr Language: English - Date: 2007-07-06 16:33:16 Finite fields Computational Diffie–Hellman assumption Diffie–Hellman problem Decisional Diffie–Hellman assumption Diffie–Hellman key exchange Hellman ElGamal encryption Whitfield Diffie XDH assumption Cryptography Computational hardness assumptions Cryptographic protocols
68	Discrete logarithms in finite fields and their cryptographic significance A. M. Odlyzko AT&T Bell Laboratories Add to Reading List Source URL: www.dtc.umn.edu Language: English - Date: 1998-04-13 22:10:57 Finite fields Logarithms Computational hardness assumptions Group theory XTR Discrete logarithm Diffie–Hellman key exchange Diffie–Hellman problem Discrete logarithm records Abstract algebra Mathematics Cryptography
69	PDF Document Add to Reading List Source URL: www.nict.go.jp Language: English - Date: 2013-09-12 01:05:36 Logarithms Computational hardness assumptions Modular arithmetic Key size Cryptanalysis Pairing-based cryptography Discrete logarithm Public-key cryptography Encryption Cryptography Abstract algebra Mathematics
70	PDF Document Add to Reading List Source URL: www.msri.org Language: English - Date: 2004-04-09 16:58:07 Computational hardness assumptions Electronic commerce RSA Cryptographic protocols Leonard Adleman Adi Shamir Diffie–Hellman problem Ron Rivest Cipher Cryptography Public-key cryptography Turing Award laureates

UPDATE